Qus : 6 Phrases PYQ 2
Consider the following minterm for F:F(P, Q, R, S) = Σ0, 2, 5, 7, 8, 10, 13, 15. The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is
1 $$\overline{Q}S+Q\overline{S}$$ 2 $$\overline{Q}\, \overline{S}+QS$$ 3 $$\overline{Q}\, \overline{R}\, \overline{S}+\overline{Q}\, R\overline{S}+Q\overline{R}\, S+QRS$$ 4 $$\overline{P}\, \overline{Q}\, \overline{S}+\overline{P}\, QS+PQS+P\, \overline{Q}\, \overline{S}$$ Go to Discussion Phrases Previous Year PYQ Phrases NIMCET 2023 PYQ
Solution Qus : 7 Phrases PYQ 1 Cosider the following Boolean Expression for F:
$F(P,Q,R,S)=PQ+\overline{P}QR+\overline{P}Q\overline{R}S$ .
The minimum sum of products form of F is
1 $$PQ+QR+QS$$ 2 $$P+Q+R+S$$ 3 $$\overline{P}+\overline{Q}+\overline{R}+\overline{S}$$ 4 $$\overline{P}\, R+\, \overline{P}\, \overline{R}\, S+P$$ Go to Discussion Phrases Previous Year PYQ Phrases NIMCET 2023 PYQ
Solution Qus : 9 Phrases PYQ 4 Let $\oplus$ and $\odot$ denote the Exclusive - OR and Exclusive-NOR operations respectively. Which of the following is not correct?
1 $$\, \overline{P}\oplus\overline{Q}=P\odot Q$$ 2 $$\, \overline{P}\oplus Q=P\odot Q$$ 3 $$\, \overline{P}\oplus\overline{Q}=P\oplus Q$$ 4 $$(P\oplus\overline{P})\oplus Q=(P\odot\overline{P})\overline{Q}$$ Go to Discussion Phrases Previous Year PYQ Phrases NIMCET 2023 PYQ
Solution Qus : 13 Phrases PYQ 1 Which of the following is equivalent to the Boolean expression:
$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$
1 $XY$ 2 $X\overline{Y}$ 3 $\overline{X}Y$ 4 $\overline{X}\, \overline{Y}$ Go to Discussion Phrases Previous Year PYQ Phrases NIMCET 2022 PYQ Solution $(X+Y).(X+\overline{Y}).(\overline{X}+Y)$
=$(X+Y)(X+Y')(X'+Y)$
=$(XX+XY+YX+YY')(X'+Y)$
=$(X+XY)(X'+Y)$
=$X(1+Y)(X'+Y)$
=$X(X'+Y)$
=$XX'+XY$
=$XY$
Qus : 16 Phrases PYQ 4 If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):
1 NOR 2 AND 3 OR 4 NAND Go to Discussion Phrases Previous Year PYQ Phrases NIMCET 2022 PYQ Solution Output is high if any of the input is low. The truth table for NAND gate is:
A B Output 0 0 0 0 1 1 1 0 1 1 1 1
Table representing NAND Gate.
[{"qus_id":"4197","year":"2019"},{"qus_id":"4376","year":"2017"},{"qus_id":"4378","year":"2017"},{"qus_id":"4385","year":"2017"},{"qus_id":"9519","year":"2020"},{"qus_id":"9527","year":"2020"},{"qus_id":"11200","year":"2022"},{"qus_id":"11201","year":"2022"},{"qus_id":"11204","year":"2022"},{"qus_id":"11207","year":"2022"},{"qus_id":"11208","year":"2022"},{"qus_id":"11594","year":"2023"},{"qus_id":"11599","year":"2023"},{"qus_id":"11603","year":"2023"},{"qus_id":"11604","year":"2023"},{"qus_id":"11610","year":"2023"}]